منابع مشابه
Bart-Moe games, JumbleG and discrepancy
Let A and B be hypergraphs with a common vertex set V . In a (p, q,A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends when every vertex has been claimed by one of the players. The first player, called Bart (to denote his role as Breaker and Avoider together), selects p vertices per move and the second player, called Moe (to denote his role ...
متن کاملDiscrepancy Games
We investigate a game played on a hypergraph H = (V,E) by two players, Balancer and Unbalancer. They select one element of the vertex set V alternately until all vertices are selected. Balancer wins if at the end of the game all edges e ∈ E are roughly equally distributed between the two players. We give a polynomial time ∗Research supported in part by a USA-Israel BSF grant, by the Israel Scie...
متن کاملSelf – Others Rating Discrepancy of Task and Contextual Performance
This research compared ratings of task performance and contextual performance from three different sources: self, peer, and supervisor. Participants were service industry employees in the service industries in Yogyakarta, Indonesia. A Sample of 146 employees and 40 supervisors from the service industries provided ratings of task performance and contextual performance. The results indicated th...
متن کاملLinear And Hereditary Discrepancy
Let A be a m n{matrix. Linear and hereditary discrepancy are deened as lindisc(A) := maxfminfkA(p ")k 1 j " 2 ff1; 1g n g jp 2 1; 1] n g herdisc(A) := maxfminfk(a ij) i2m];j2J "k 1 j " 2 ff1; 1g n g jJ n]g: We're investigating connections between the two concepts. Best results known are lindisc(A) 2(1 2 2 n) herdisc(A) for any matrix A and an example of an A satisfying lindisc(A) = 2(1 1 n+1) h...
متن کاملDiscrepancy and Uniformity
It can be proved that 1/N ≤ DN ≤ 1 and 1/(2N) ≤ D∗ N ≤ DN ≤ 2D∗ N . The sequence X is uniformly distributed in [0, 1) if and only if limN→∞DN(X) = 0. We are interested in low-discrepancy sequences, that is, sequences X for which DN(X) is small for all N . The efficient construction of such X is essential in quasi-Monte Carlo algorithms used, for example, to approximate a multivariate integral o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2006.03.004